Towards the use of Simplification Rules in Intuitionistic Tableaux
نویسندگان
چکیده
By replacement it is meant the substitution of one or more occurrences of a formula with an equivalent one. In automated deduction this can be useful to reduce the search space. In tableau calculi for classical and modal logics this technique is known as simplification and consists in replacing a formula with a logical constant (> or ⊥). Recently, this idea has been applied to Intuitionistic Logic. This work in progress investigates further conditions on the applicability of Simplification in Intuitionistic Logic.
منابع مشابه
A Simplification Rules for Intuitionistic Propositional Tableaux
The implementation of a logic requires, besides the definition of a calculus and a decision procedure, the development of techniques to reduce the search space. In this paper we introduce some simplification rules for Intuitionistic propositional logic that try to replace a formula with an equi-satisfiable “simpler” one with the aim to reduce the search space. Our results are proved via semanti...
متن کاملTableau Calculi for the Logics of Finite k-Ary Trees
We present tableau calculi for the logics Dk (k ≥ 2) semantically characterized by the classes of Kripke models built on finite k-ary trees. Our tableau calculi use the signs T and F, some tableau rules for Intuitionistic Logic and two rules formulated in a hypertableau fashion. We prove the Soundness and Completeness Theorems for our calculi. Finally, we use them to prove the main properties o...
متن کاملSimplification Rules for Constrained Formula Tableaux
Several variants of a first-order simplification rule for nonnormal form tableaux using syntactic constraints are presented. These can be used as a framework for porting methods like unit resolution or hyper tableaux to non-normal form free variable tableaux.
متن کاملOn Constructive Cut Admissibility in Deduction Modulo
Deduction modulo is a theoretical framework which allows the introduction of computational steps in deductive systems. This approach is well suited to automated theorem proving. We describe a proofsearch method based upon tableaux for Gentzen’s intuitionistic LJ extended with rewrite rules on propositions and terms . We prove its completeness with respect to Kripke structures. Then we give a so...
متن کاملA Constructively Adequate Refutation System for Intuitionistic Logic
6 International Conference TABLEAUX’97 – Short Papers, Technical Report CRIN 97-R-030, Université de Nancy II, 1997 Abstract. We present a refutation system for intuitionistic logic which allows to locate situations where constructive reasoning is unnecessary. In many subgoals of a derivation this property makes it possible to reduce the set of relevant reduction rules to a confluent one. As a ...
متن کامل